Selective Linear Predictive Spectral Matching

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Methods for Linear Predictive Spectral Modelling of Speech

Linear prediction (LP) is among the most widely used parametric spectral modelling techniques of discrete-time information. This method, also known as autoregressive (AR) spectral modelling, is particularly well-suited to processing of speech signals, and it has become a major technique that is currently used in almost all areas of speech science. This thesis deals with LP by proposing three no...

متن کامل

Wide baseline spectral matching

Wide baseline matching of images is an important problem in multimedia and computer vision. Recently a class of spectral methods have been proposed for tasks like segmentation. In this paper we propose a spectral algorithm for wide baseline matching.

متن کامل

Selective Regular Expression Matching

The signature-based intrusion detection is one of the most commonly used techniques implemented in modern intrusion detection systems (IDS). One of the powerful tools that gained wide acceptance in IDS signatures over the past several years is the regular expressions. However, the performance requirements of traditional methods for matching the incoming events against regular expressions are pr...

متن کامل

On predictive probability matching priors

We revisit the question of priors that achieve approximate matching of Bayesian and frequentist predictive probabilities. Such priors may be thought of as providing frequentist calibration of Bayesian prediction or simply as devices for producing frequentist prediction regions. Here we analyse the O(n) term in the expansion of the coverage probability of a Bayesian prediction region, as derived...

متن کامل

B-Matching for Spectral Clustering

We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maximum weight matching and is solvable in polynomial time. Instead of a permutation matrix, it produces a binary matrix with rows and columns summing to a positive integer b. The b-matching procedure prunes graph edges s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Acoustical Society of America

سال: 1974

ISSN: 0001-4966

DOI: 10.1121/1.3437198